Evolutionary computation for multicomponent problems: opportunities and future directions

نویسندگان

  • Mohammad Reza Bonyadi
  • Zbigniew Michalewicz
  • Frank Neumann
  • Markus Wagner
چکیده

Over the past 30 years many researchers in the field of evolutionary computation have put a lot of effort to introduce various approaches for solving hard problems. Most of these problems have been inspired by major industries so that solving them, by providing either optimal or near optimal solution, was of major significance. Indeed, this was a very promising trajectory as advances in these problem-solving approaches could result in adding values to major industries. In this paper we revisit this trajectory to find out whether the attempts that started three decades ago are still aligned with the same goal, as complexities of real-world problems increased significantly. We present some examples of modern real-world problems, discuss why they might be difficult to solve, and whether there is any mismatch between these examples and the problems that are investigated in the evolutionary computation area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Current developments and future directions of bio-inspired computation and implications for ecoinformatics

Article history: Received 15 July 2005 Accepted 15 July 2005 EC TE D P Evolutionary and neural computation has been used widely in solving various problems in biological ecosystems. This paper reviews some of the recent work in evolutionary computation and neural network ensembles that could be explored further in the context of ecoinformatics. Although these bio-inspired techniques were not de...

متن کامل

Shuffled Frog-Leaping Programming for Solving Regression Problems

There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...

متن کامل

Bio-inspired Combinatorial Optimization: Notes on Reactive and Proactive Interaction

Evolutionary combinatorial optimization (ECO) is a branch of evolutionary computing (EC) focused on finding optimal values for combinatorial problems. Algorithms ranging in this category require that the user defines, before the process of evolution, the fitness measure (i.e., the evaluation function) that will be used to guide the evolution of candidate solutions. However, there are many probl...

متن کامل

Global Optimisation by Evolutionary Algorithms

Evolutionary algorithms (EAs) are a class of stochastic search algorithms applicable to a wide range of problems in learning and optimisation. They have been applied to numerous problems in combinatorial optimi-sation, function optimisation, artiicial neural network learning, fuzzy logic system learning, etc. This paper rst introduces EAs and their basic operators. Then an overview of three maj...

متن کامل

Surrogate-assisted evolutionary computation: Recent advances and future challenges

Surrogate-assisted, or meta-model based evolutionary computation uses efficient computational models, often known as surrogates or meta-models, for approximating the fitness function in evolutionary algorithms. Research on surrogate-assisted evolutionary computation began over a decade ago and has received considerably increasing interest in recent years. Very interestingly, surrogate-assisted ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1606.06818  شماره 

صفحات  -

تاریخ انتشار 2014